Jedi: A Storage Manager for SIMD-aware, Worst-case Optimal Join Processing
نویسنده
چکیده
This talk describes a new graph-pattern engine called Jedi. Using a recent simplification of worst-case optimal join algorithms due to Ngo et al., Jedi translates join queries into a series of set intersection and union operations. Such set operations are ideally suited to modern CPUs that provides single-instruction, multiple data (SIMD) instructions. Using these ideas, we demonstrate that Jedi outperforms specialized graph engines by over an order of magnitude and relational systems by over two orders of magnitude on standard graph processing queries over real data.
منابع مشابه
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015
This talk describes a new graph-pattern engine called Jedi.Using a recent simplification of worst-case optimal join al-gorithms due to Ngo et al., Jedi translates join queries intoa series of set intersection and union operations. Such setoperations are ideally suited to modern CPUs that providessingle-instruction, multiple data (SIMD) instructions. Usingthese ideas, we ...
متن کاملRuntime Optimization of Join Location in Parallel Data Management Systems
Applications running on parallel systems often need to join a streaming relation or a stored relation with data indexed in a parallel data storage system. Some applications also compute UDFs on the joined tuples. The join can be done at the data storage nodes, corresponding to reduce side joins, or by fetching data from the storage system to compute nodes, corresponding to map side join. Both m...
متن کاملMultipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs
Recent work has demonstrated that the use of programmable GPUs can be advantageous during relational query processing on analytical workloads. In this paper, we take a closer look at graph problems such as finding all triangles and all four-cliques of a graph. In particular, we present two different join algorithms for the GPU. The first is an implementation of Leapfrog-Triejoin (LFTJ), a recen...
متن کاملWorst-Case Optimal Join at a Time
Joins are at the core of database systems, yet worst-case optimal join algorithms have been developed only recently. At the outset of this effort is the observation that the standard join plans are suboptimal as their intermediate results may be larger than the final result. To attain worst-case optimality, new join algorithms are monolithic and thus avoid intermediate results. The conceptual c...
متن کاملLinks between Join Processing and Convex Geometry
This talk will survey some results on join processing that use inequalities from convex geometry. Recently, Ngo, Porat, Rudra, and Ré (NPRR) discovered the first relational join algorithm with worst-case optimal running time [8]. Since the seminal System R project [12], the dominant database optimizer paradigm optimizes a join query by examining each pair of joins and then combining these estim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015